Risk analysis sampling methods in terrorist networks based on the Banzhaf value

This article introduces the Banzhaf and the Banzhaf–Owen values as novel measures of risk analysis of a terrorist attack, determining the most dangerous terrorists in a network. This new approach counts with the advantage of integrating at the same time the complete topology (i.e., nodes and edges) of the network and a coalitional structure on the nodes of the network. More precisely, the characteristics of the nodes (e.g., terrorists) of the network and their possible relationships (e.g., types of communication links), as well as coalitional information (e.g., level of hierarchies) independent of the network. First, for these two new measures of risk analysis, we provide and implement approximation algorithms. Second, as illustration, we rank the members of the Zerkani network, responsible for the attacks in Paris (2015) and Brussels (2016). Finally, we give a comparison between the rankings established by the Banzhaf and the Banzhaf–Owen values as measures of risk analysisMinisterio de Ciencia e Innovación, Grant/Award Numbers: PGC2018-097965-B-I00, PID2021-124030NB-C32; Xunta de Galicia, Grant/Award Number: ED431C 2021/24; Ministerio de Ciencia, Innovación y Universidades, Grant/Award Number: MTM2017-87197-C3-3-PS

Node aggregation for enhancing PageRank

In this paper, we study the problem of node aggregation under different perspectives for increasing PageRank of some nodes of interest. PageRank is one of the parameters used by the search engine Google to determine the relevance of a web page. We focus our attention to the problem of nding the best nodes in the network from an aggregation viewpoint, i.e., what are the best nodes to merge with for the given nodes. This problem is studied from global and local perspectives. Approximations are proposed to reduce the computation burden and to overcome the limitations resulting from the lack of centralized information. Several examples are presented to illustrate the different approaches that we proposeFP7-ICT Project DYMASOS under Grant 611281Ministerio de Economía y Competitividad COOPERA Project Grant DPI2013-46912-C2-1-RMinisterio de Educación José Castillejo Grant (CAS14/00277)Grant-in-Aid for Scientific Research Grant 15H04020 and Fellowship PE1604

Multi-issue bankruptcy problems with crossed claims

In this paper, we introduce a novel model of multi-issue bankruptcy problem inspired from a real problem of abatement of emissions of different pollutants in which pollutants can have more than one effect on atmosphere. In our model, therefore, several perfectly divisible goods (estates) have to be allocated among certain set of agents (claimants) that have exactly one claim which is used in all estates simultaneously. In other words, unlike of the multi-issue bankruptcy problems already existent in the literature, this model study situations with multi- dimensional states, one for each issue and where each agent claims the same to the different issues in which participates. In this context, we present an allocation rule that generalizes the well-known constrained equal awards rule from a procedure derived from analyzing this rule for classical bankruptcy problems as the solution to a sucession of linear programming problems. Next, we carry out an study of its main properties, and we characterize it using the well-known property of consistency

An iterative design method for Coalitional control networks with constraints on the shapley Value

9th World CongressThe International Federation of Automatic ControlCape Town, South Africa. August 24-29In this work, we introduce a new iterative design method for a coalitional control scheme for linear systems recently proposed. In this scheme, the links in the network infrastructure are enabled or disabled depending on their contribution to the overall system performance. As a consequence, the local controllers are divided dynamically into sets or coalitions that cooperate in order to attain their control tasks. The new design method allows the control system designer to include new constraints regarding the game theoretical tools of the control architecture, while optimizing the matrices that define the controller

An Application of Cooperative Game Theory to Distributed Control

18th World CongressThe International Federation of Automatic ControlMilano (Italy) August 28 - September 2, 2011In this paper we propose to study the underlying properties of a given distributed control scheme in which a set of agents switch between different communication strategies that define which network links are used in order to regulate to the origin a set of unconstrained linear systems. The problems of how to decide the time-varying communication strategy, share the benefits/costs and detect which are the most critical links in the network are solved using tools from game theory. The proposed scheme is demonstrated through a simulation example

A game theoretical randomized method for large-scale systems partitioning

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, a game theory-based partitioning algorithm for large-scale systems (LSS) is proposed. More specifically, a game over nodes is introduced in a model predictive control framework. The Shapley value of this game is used to rank the communication links of the control network based on their impact on the overall system performance. A randomized method to estimate the Shapley value of each node and also an efficient redistribution of the resulting value to the links involved are considered to relieve the combinatorial explosion issues related to LSS. Once the partitioning solution is obtained, a sensitivity analysis is proposed to give a measure of its performance. Likewise, a greedy fine tuning procedure is considered to increase the optimality of the partitioning results. The full Barcelona drinking water network (DWN) is analyzed as a real LSS case study showing the effectiveness of the proposed approach in comparison with other partitioning schemes available in the literature.Peer ReviewedPostprint (author's final draft

Diseño de una metodología para la evaluación de la eficiencia de redes de metro basada en DEA

En el presente trabajo se propone una metodología basada en DEA que proporcione la eficiencia de redes de metro. A partir de las dos salidas que se han identificado como las que mejor representan el buen funcionamiento de las redes de metro (pasajeros y pasajeros por Km.), se establece una regresión multivariante que determine, de entre todos los recursos utilizados por la red, los que mejor explican las salidas consideradas. Este resultado se analiza mediante un análisis DEA, para posteriormente diseñar un perceptrón multinivel capaz de prever los targets de una red no analizada.Junta de Andalucía (España) P06-TEP-02219Junta de Andalucía (España) TEP-5022Junta de Andalucía (España) CEDEX PT-2007-003-08CCP

Un nuevo enfoque para la determinación de horarios de unidades rodantes

El objetivo principal en este trabajo es la programación de horarios de viajes en tren de acuerdo a los deseos de movilidad de los pasajeros, en el caso de frecuencias medias. Por tanto, se analiza el diseño de horarios en recorridos de media y larga distancia. Este problema, resulta de interés para satisfacer las necesidades de los usuarios, adicionalmente es significativo porque existen actualmente pocas aproximaciones sobre este tema. Otros aspectos que resultan inseparables del problema de scheduling, como la medición de la capacidad del servicio o la propia calidad del servicio, se estudian de manera conjunta.Junta de Andalucía (España) P06-TEP-02219Junta de Andalucía (España) TEP-5022Junta de Andalucía (España) CEDEX PT-2007-003-08CCP

Extensión de juegos definidos en sistemas de conjuntos

"Este trabajo de investigación, fundamentalmente, propone un nuevo modelo para la generalización del iniciado por Myerson (1977). Con este objetivo se analizan estructuras estables para la unión de coaliciones con intersección no vacía, que tienen como caso particular a las situaciones de comunicación. Por otro lado, se establece una estrecha relación entre las estructuras de cooperación u-estables y las situaciones de comunicación en hipergrafos debidas a Myerson (1980) y estudiadas por Van Den Nouweland, Boom y Tijs (1992). Las herramientas básicas que han permitido esta generalización, así como el análisis y caracterización del valor de Myerson de posición en este contexto han sido la introducción del concepto de base y de un procedimiento recursivo que genera las coaliciones factibles. Asimismo, se plantean métodos para un cómputo más eficaz del valor de Myerson y de posición respectivamente y se estudian bajo qué condiciones estos valores son elementos del core del juego restringido (lo cual ha obligado a investigar la transmisión de la convexidad del juego original a los juegos introducidos.

An approach from bankruptcy rules applied to the apportionment problem in proportional electoral systems

(Discrete) bankruptcy problems associated with apportionment problems have been defined. The authors studied which allocations for apportionment problems have been obtained when (discrete) bankruptcy rules were applied to the associated bankruptcy problems. They have shown that the (dis-crete) constrained equal losses rule coincides with the greatest remainder method for apportionment problems. Furthermore, new properties related to governability have been proposed for apportionment methods. Finally, several apportionment methods satisfying governability properties have been applied to the case of the Spanish Elections in 2015